Hardware Verification Using Co-induction in COQ
نویسندگان
چکیده
This paper presents a toolbox implemented in Coq and dedicated to the speciication and veriication of synchronous sequential devices. The use of Coq co-inductive types underpins our methodology and leads to elegant and uniform descriptions of the circuits and their behaviours as well as clear and short proofs. An application to a non trivial circuit is given as an illustration.
منابع مشابه
On the Strong Co-induction in Coq
Using theorem prover Coq [4] for the verification of concurrent systems usually includes the formalization of the modal μ–calculus [8] in that logical framework [13] [11] [15]. These implementations build upon the following interpretation: given the state space S of a system, the meaning of a formula is the subset of states where it is satisfied. Then, a formula α(X) with a free variable X can ...
متن کاملFormal Verification of Hardware Synthesis
We report on the implementation of a certified compiler for a high-level hardware description language (HDL) called Fe-Si (FEatherweight SynthesIs). Fe-Si is a simplified version of Bluespec, an HDL based on a notion of guarded atomic actions. Fe-Si is defined as a dependently typed deep embedding in Coq. The target language of the compiler corresponds to a synthesisable subset of Verilog or VH...
متن کاملFormal Verification of Arithmetic Functions in SmartMIPS Assembly∗
In embedded systems, the recent trend is to manufacture processors with application-specific extensions. This makes it often necessary to write assembly programs to take advantage of the added hardware facilities. In such situations, formal verification is technically difficult because the programs in question manipulate data in a bitwise fashion, using non-standard specialized instructions, an...
متن کاملFormal Veriication of Microprocessors: a Rst Experiment with the Coq Proof Assistant
We propose in this paper a study of the Coq proof assistant for formally verifying microprocessors. We show that interactive proofs with Coq are only required to verify complex instructions of microprocessors. We give our speciication and veriication methodology and some details about the word library developed in Coq. Two full examples show additional speciication and veriication aspects. We a...
متن کاملVerification of the Redecoration Algorithm for Triangular Matrices
Triangular matrices with a dedicated type for the diagonal elements can be profitably represented by a nested datatype, i. e., a heterogeneous family of inductive datatypes. These families are fully supported since the version 8.1 of the Coq theorem proving environment, released in 2007. Redecoration of triangular matrices has a succinct implementation in this representation, thus giving the ch...
متن کامل